Current Directions in Hyper-Programming
نویسندگان
چکیده
The traditional representation of a program is as a linear sequence of text. At some stage in the execution sequence the source text is checked for type correctness and its translated form is linked to values in the environment. When this is performed early in the execution process, confidence in the correctness of the program is raised. During program execution, tools such as debuggers are used to inspect the running state of programs. Relating this state to the linear text is often problematical. We have developed a technique, hyperprogramming, that allows the representations of source programs to include direct links (hyper-links) to values, including code, that already exist in the environment. Hyper-programming achieves our two objectives of being able to link earlier than before, at program composition time, and to represent sharing and thus closure and through this the run-time state of a program. This paper reviews our work on hyper-programming and proposes some current research areas.
منابع مشابه
A structural geometrical analysis of weakly infeasible SDPs
In this article, we present a geometric theoretical analysis of semidefinite feasibility problems (SDFPs). We introduce the concept of hyper feasible partitions and sub-hyper feasible directions, and show how they can be used to decompose SDFPs into smaller ones, in a way that preserves most feasibility properties of the original problem. With this technique, we develop a detailed analysis of w...
متن کاملA Genetic Programming Approach to the Generation of Hyper-Heuristics for the Uncapacitated Examination Timetabling Problem
Research in the field of examination timetabling has developed in two directions. The first looks at applying various methodologies to induce examination timetables. The second takes an indirect approach to the problem and examines the generation of heuristics or combinations of heuristics, i.e. hyper-heuristics, to be used in the construction of examination timetables. The study presented in t...
متن کاملHybridizations within a graph-based hyper-heuristic framework for university timetabling problems
A significant body of recent literature has explored various research directions in hyperheuristics (which can be thought as heuristics to choose heuristics). In this paper, we extend our previous work to construct a unified graph based hyper-heuristic (GHH) framework, under which a number of local search based algorithms as the high level heuristics are studied to search upon sequences of low ...
متن کاملHybridisations within a Graph Based Hyper-heuristic Framework for University Timetabling Problems
A significant body of literature has explored various research directions in hyper-heuristics (which can be thought as heuristics to choose heuristics). In this paper we define a graph based hyper-heuristic (GHH) framework and compare the performance of a number of local search based searching algorithms as the high level heuristics. They are used to search upon permutations of low level graph ...
متن کامل3D BENCHMARK RESULTS FOR ROBUST STRUCTURAL OPTIMIZATION UNDER UNCERTAINTY IN LOADING DIRECTIONS
This study has been inspired by the paper "An efficient 3D topology optimization code written in MATLAB” written by Liu and Tovar (2014) demonstrating that SIMP-based three-dimensional (3D) topology optimization of continuum structures can be implemented in 169 lines of MATLAB code. Based on the above paper, we show here that, by simple and easy-to-understand modificati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999